// Copyright [2020] <unknown>
#include <bits/stdc++.h>
using namespace std;
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define dbg(x...) { cerr << "\033[32;1m" << #x << " -> "; err(x); }
void err() { cerr << "\033[39;0m" << endl; }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }
#else
#define dbg(...)
#endif

#define sz(x) ((int)x.size())

typedef long long LL;

const int N = 1e5+50;

int x, y, a, b, c;

int p[N], q[N], r[N];


int main(int argc, char const *argv[]) {
    // code
    scanf("%d%d%d%d%d", &x, &y, &a, &b, &c);
    for (int i=0; i<a; ++i)
        scanf("%d", &p[i]);
    for (int i=0; i<b; ++i)
        scanf("%d", &q[i]);
    for (int i=0; i<c; ++i)
        scanf("%d", &r[i]);
    sort(p, p+a);
    sort(q, q+b);
    sort(r, r+c);
    vector<int> v;
    v.reserve(x+y+c);
    for (int i=0; i<x; ++i)
        v.push_back(p[a-i-1]);
    for (int i=0; i<y; ++i)
        v.push_back(q[b-i-1]);
    for (int i=0; i<c; ++i)
        v.push_back(r[i]);
    sort(v.begin(), v.end());
    reverse(v.begin(), v.end());
    LL ans = 0;
    for (int i=0; i<x+y; ++i)
        ans += v[i];
    cout << ans << endl;
    return 0;
}
